Discovery of the triple asteroidal system 87 Sylvia
نویسندگان
چکیده
منابع مشابه
Physical and dynamical properties of the main belt triple asteroid (87) Sylvia
We present the analysis of high angular resolution observations of the triple asteroid (87) Sylvia collected with three 8–10 m class telescopes (Keck, VLT, Gemini North) and the Hubble Space Telescope. The moons’ mutual orbits were derived individually using a purely Keplerian model. We computed the position of Romulus, the outer moon of the system, at the epoch of a recent stellar occultation ...
متن کاملAsteroidal Triple-Free Graphs
An independent set of three vertices such that each pair is joined by a path that avoids the neighborhood of the third is called an asteroidal triple. A graph is asteroidal triple-free (AT-free) if it contains no asteroidal triples. The motivation for this investigation was provided, in part, by the fact that the AT-free graphs provide a common generalization of interval, permutation, trapezoid...
متن کاملVertex Ranking of Asteroidal Triple-Free Graphs
We present an efficient algorithm for computing the vertex ranking number of an asteroidal triple-free graph. lts running time is bounded by a polynomial in the number of vertices and the number of minimal separators of the input graph.
متن کاملLexBFS-Ordering in Asteroidal Triple-Free Graphs
In this paper, we study the metric property of LexBFS-ordering on AT-free graphs. Based on a 2-sweep LexBFS algorithm, we show that every AT-free graph admits a vertex ordering, called the strong 2-cocomparability ordering, that for any three vertices u v w in the ordering, if d(u; w) 2 then d(u; v) = 1 or d(v; w) 2. As an application of this ordering, we provide a simple linear time recognitio...
متن کاملInduced matchings in asteroidal triple-free graphs
An induced matching M of a graph G is a set of pairwise nonadjacent edges such that no two edges of M are joined by an edge in G. The problem of /nding a maximum induced matching is known to be NP-hard even for bipartite graphs of maximum degree four. In this paper, we study the maximum induced matching problem on classes of graphs related to AT-free graphs. We /rst de/ne a wider class of graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 2005
ISSN: 0028-0836,1476-4687
DOI: 10.1038/nature04018